Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

A(c(x1)) → B(c(a(x1)))
A(c(x1)) → B(c(a(b(c(a(x1))))))
A(c(x1)) → A(x1)
A(c(x1)) → A(b(c(a(x1))))

The TRS R consists of the following rules:

a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(x1)) → B(c(a(x1)))
A(c(x1)) → B(c(a(b(c(a(x1))))))
A(c(x1)) → A(x1)
A(c(x1)) → A(b(c(a(x1))))

The TRS R consists of the following rules:

a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(x1)) → A(x1)
A(c(x1)) → A(b(c(a(x1))))

The TRS R consists of the following rules:

a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


A(c(x1)) → A(x1)
The remaining pairs can at least be oriented weakly.

A(c(x1)) → A(b(c(a(x1))))
Used ordering: Polynomial Order [21,25] with Interpretation:

POL( A(x1) ) = x1 + 1


POL( c(x1) ) = x1 + 1


POL( b(x1) ) = max{0, x1 - 1}


POL( a(x1) ) = x1 + 1



The following usable rules [17] were oriented:

a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(x1)) → A(b(c(a(x1))))

The TRS R consists of the following rules:

a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(c(x1)) → A(b(c(a(x1)))) at position [0] we obtained the following new rules:

A(c(y0)) → A(a(y0))
A(c(b(x0))) → A(b(c(x0)))
A(c(c(x0))) → A(b(c(b(c(a(b(c(a(x0)))))))))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(b(x0))) → A(b(c(x0)))
A(c(c(x0))) → A(b(c(b(c(a(b(c(a(x0)))))))))
A(c(y0)) → A(a(y0))

The TRS R consists of the following rules:

a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule A(c(b(x0))) → A(b(c(x0))) at position [0] we obtained the following new rules:

A(c(b(x0))) → A(x0)



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

A(c(c(x0))) → A(b(c(b(c(a(b(c(a(x0)))))))))
A(c(b(x0))) → A(x0)
A(c(y0)) → A(a(y0))

The TRS R consists of the following rules:

a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The finiteness of this DP problem is implied by strong termination of a SRS due to [12].


↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1
A(c(c(x0))) → A(b(c(b(c(a(b(c(a(x0)))))))))
A(c(b(x0))) → A(x0)
A(c(y0)) → A(a(y0))

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1
A(c(c(x0))) → A(b(c(b(c(a(b(c(a(x0)))))))))
A(c(b(x0))) → A(x0)
A(c(y0)) → A(a(y0))

The set Q is empty.
We have obtained the following QTRS:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x
c(c(A(x))) → a(c(b(a(c(b(c(b(A(x)))))))))
b(c(A(x))) → A(x)
c(A(x)) → a(A(x))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ DependencyPairsProof
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x
c(c(A(x))) → a(c(b(a(c(b(c(b(A(x)))))))))
b(c(A(x))) → A(x)
c(A(x)) → a(A(x))

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

C(c(A(x))) → B(a(c(b(c(b(A(x)))))))
C(c(A(x))) → C(b(a(c(b(c(b(A(x))))))))
C(a(x)) → B(x)
C(a(x)) → C(b(a(c(b(x)))))
C(c(A(x))) → B(c(b(A(x))))
C(a(x)) → B(a(c(b(x))))
C(a(x)) → C(b(x))
C(c(A(x))) → B(A(x))
C(c(A(x))) → C(b(c(b(A(x)))))
C(c(A(x))) → C(b(A(x)))

The TRS R consists of the following rules:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x
c(c(A(x))) → a(c(b(a(c(b(c(b(A(x)))))))))
b(c(A(x))) → A(x)
c(A(x)) → a(A(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(c(A(x))) → B(a(c(b(c(b(A(x)))))))
C(c(A(x))) → C(b(a(c(b(c(b(A(x))))))))
C(a(x)) → B(x)
C(a(x)) → C(b(a(c(b(x)))))
C(c(A(x))) → B(c(b(A(x))))
C(a(x)) → B(a(c(b(x))))
C(a(x)) → C(b(x))
C(c(A(x))) → B(A(x))
C(c(A(x))) → C(b(c(b(A(x)))))
C(c(A(x))) → C(b(A(x)))

The TRS R consists of the following rules:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x
c(c(A(x))) → a(c(b(a(c(b(c(b(A(x)))))))))
b(c(A(x))) → A(x)
c(A(x)) → a(A(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 6 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(c(A(x))) → C(b(a(c(b(c(b(A(x))))))))
C(a(x)) → C(b(a(c(b(x)))))
C(a(x)) → C(b(x))
C(c(A(x))) → C(b(c(b(A(x)))))

The TRS R consists of the following rules:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x
c(c(A(x))) → a(c(b(a(c(b(c(b(A(x)))))))))
b(c(A(x))) → A(x)
c(A(x)) → a(A(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(a(x)) → C(b(x)) at position [0] we obtained the following new rules:

C(a(a(x0))) → C(x0)
C(a(c(A(x0)))) → C(A(x0))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ DependencyGraphProof
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(c(A(x))) → C(b(a(c(b(c(b(A(x))))))))
C(a(x)) → C(b(a(c(b(x)))))
C(a(c(A(x0)))) → C(A(x0))
C(a(a(x0))) → C(x0)
C(c(A(x))) → C(b(c(b(A(x)))))

The TRS R consists of the following rules:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x
c(c(A(x))) → a(c(b(a(c(b(c(b(A(x)))))))))
b(c(A(x))) → A(x)
c(A(x)) → a(A(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ DependencyGraphProof
                                            ↳ QDP
                                              ↳ Narrowing
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(c(A(x))) → C(b(a(c(b(c(b(A(x))))))))
C(a(x)) → C(b(a(c(b(x)))))
C(a(a(x0))) → C(x0)
C(c(A(x))) → C(b(c(b(A(x)))))

The TRS R consists of the following rules:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x
c(c(A(x))) → a(c(b(a(c(b(c(b(A(x)))))))))
b(c(A(x))) → A(x)
c(A(x)) → a(A(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(c(A(x))) → C(b(c(b(A(x))))) at position [0] we obtained the following new rules:

C(c(A(y0))) → C(b(A(y0)))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ DependencyGraphProof
                                            ↳ QDP
                                              ↳ Narrowing
                                                ↳ QDP
                                                  ↳ DependencyGraphProof
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(c(A(x))) → C(b(a(c(b(c(b(A(x))))))))
C(a(x)) → C(b(a(c(b(x)))))
C(a(a(x0))) → C(x0)
C(c(A(y0))) → C(b(A(y0)))

The TRS R consists of the following rules:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x
c(c(A(x))) → a(c(b(a(c(b(c(b(A(x)))))))))
b(c(A(x))) → A(x)
c(A(x)) → a(A(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ DependencyGraphProof
                                            ↳ QDP
                                              ↳ Narrowing
                                                ↳ QDP
                                                  ↳ DependencyGraphProof
                                                    ↳ QDP
                                                      ↳ Narrowing
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(c(A(x))) → C(b(a(c(b(c(b(A(x))))))))
C(a(x)) → C(b(a(c(b(x)))))
C(a(a(x0))) → C(x0)

The TRS R consists of the following rules:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x
c(c(A(x))) → a(c(b(a(c(b(c(b(A(x)))))))))
b(c(A(x))) → A(x)
c(A(x)) → a(A(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(a(x)) → C(b(a(c(b(x))))) at position [0] we obtained the following new rules:

C(a(x0)) → C(b(a(x0)))
C(a(c(A(x0)))) → C(b(a(c(A(x0)))))
C(a(a(x0))) → C(b(a(c(x0))))
C(a(y0)) → C(c(b(y0)))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ DependencyGraphProof
                                            ↳ QDP
                                              ↳ Narrowing
                                                ↳ QDP
                                                  ↳ DependencyGraphProof
                                                    ↳ QDP
                                                      ↳ Narrowing
                                                        ↳ QDP
                                                          ↳ Narrowing
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(x0)) → C(b(a(x0)))
C(c(A(x))) → C(b(a(c(b(c(b(A(x))))))))
C(a(c(A(x0)))) → C(b(a(c(A(x0)))))
C(a(a(x0))) → C(b(a(c(x0))))
C(a(a(x0))) → C(x0)
C(a(y0)) → C(c(b(y0)))

The TRS R consists of the following rules:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x
c(c(A(x))) → a(c(b(a(c(b(c(b(A(x)))))))))
b(c(A(x))) → A(x)
c(A(x)) → a(A(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(c(A(x))) → C(b(a(c(b(c(b(A(x)))))))) at position [0] we obtained the following new rules:

C(c(A(y0))) → C(b(a(c(b(A(y0))))))
C(c(A(y0))) → C(c(b(c(b(A(y0))))))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ DependencyGraphProof
                                            ↳ QDP
                                              ↳ Narrowing
                                                ↳ QDP
                                                  ↳ DependencyGraphProof
                                                    ↳ QDP
                                                      ↳ Narrowing
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ Narrowing
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(x0)) → C(b(a(x0)))
C(a(c(A(x0)))) → C(b(a(c(A(x0)))))
C(c(A(y0))) → C(b(a(c(b(A(y0))))))
C(c(A(y0))) → C(c(b(c(b(A(y0))))))
C(a(a(x0))) → C(b(a(c(x0))))
C(a(a(x0))) → C(x0)
C(a(y0)) → C(c(b(y0)))

The TRS R consists of the following rules:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x
c(c(A(x))) → a(c(b(a(c(b(c(b(A(x)))))))))
b(c(A(x))) → A(x)
c(A(x)) → a(A(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule C(a(x0)) → C(b(a(x0))) at position [0] we obtained the following new rules:

C(a(x0)) → C(x0)



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ DependencyPairsProof
                                ↳ QDP
                                  ↳ DependencyGraphProof
                                    ↳ QDP
                                      ↳ Narrowing
                                        ↳ QDP
                                          ↳ DependencyGraphProof
                                            ↳ QDP
                                              ↳ Narrowing
                                                ↳ QDP
                                                  ↳ DependencyGraphProof
                                                    ↳ QDP
                                                      ↳ Narrowing
                                                        ↳ QDP
                                                          ↳ Narrowing
                                                            ↳ QDP
                                                              ↳ Narrowing
                                                                ↳ QDP
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q DP problem:
The TRS P consists of the following rules:

C(a(c(A(x0)))) → C(b(a(c(A(x0)))))
C(a(x0)) → C(x0)
C(c(A(y0))) → C(b(a(c(b(A(y0))))))
C(a(a(x0))) → C(b(a(c(x0))))
C(c(A(y0))) → C(c(b(c(b(A(y0))))))
C(a(a(x0))) → C(x0)
C(a(y0)) → C(c(b(y0)))

The TRS R consists of the following rules:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x
c(c(A(x))) → a(c(b(a(c(b(c(b(A(x)))))))))
b(c(A(x))) → A(x)
c(A(x)) → a(A(x))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We have reversed the following QTRS:
The set of rules R is

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x
c(c(A(x))) → a(c(b(a(c(b(c(b(A(x)))))))))
b(c(A(x))) → A(x)
c(A(x)) → a(A(x))

The set Q is empty.
We have obtained the following QTRS:

a(b(x)) → x
a(c(x)) → b(c(a(b(c(a(x))))))
b(c(x)) → x
A(c(c(x))) → A(b(c(b(c(a(b(c(a(x)))))))))
A(c(b(x))) → A(x)
A(c(x)) → A(a(x))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ DependencyPairsProof
                              ↳ QTRS Reverse
                                ↳ QTRS
                              ↳ QTRS Reverse
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(b(x)) → x
a(c(x)) → b(c(a(b(c(a(x))))))
b(c(x)) → x
A(c(c(x))) → A(b(c(b(c(a(b(c(a(x)))))))))
A(c(b(x))) → A(x)
A(c(x)) → A(a(x))

Q is empty.

We have reversed the following QTRS:
The set of rules R is

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x
c(c(A(x))) → a(c(b(a(c(b(c(b(A(x)))))))))
b(c(A(x))) → A(x)
c(A(x)) → a(A(x))

The set Q is empty.
We have obtained the following QTRS:

a(b(x)) → x
a(c(x)) → b(c(a(b(c(a(x))))))
b(c(x)) → x
A(c(c(x))) → A(b(c(b(c(a(b(c(a(x)))))))))
A(c(b(x))) → A(x)
A(c(x)) → A(a(x))

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ QDP
          ↳ QDPOrderProof
            ↳ QDP
              ↳ Narrowing
                ↳ QDP
                  ↳ Narrowing
                    ↳ QDP
                      ↳ QDPToSRSProof
                        ↳ QTRS
                          ↳ QTRS Reverse
                            ↳ QTRS
                              ↳ DependencyPairsProof
                              ↳ QTRS Reverse
                              ↳ QTRS Reverse
                                ↳ QTRS
  ↳ QTRS Reverse
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

a(b(x)) → x
a(c(x)) → b(c(a(b(c(a(x))))))
b(c(x)) → x
A(c(c(x))) → A(b(c(b(c(a(b(c(a(x)))))))))
A(c(b(x))) → A(x)
A(c(x)) → A(a(x))

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1

The set Q is empty.
We have obtained the following QTRS:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
    ↳ QTRS
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x

Q is empty.

We have reversed the following QTRS:
The set of rules R is

a(b(x1)) → x1
a(c(x1)) → b(c(a(b(c(a(x1))))))
b(c(x1)) → x1

The set Q is empty.
We have obtained the following QTRS:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x

The set Q is empty.

↳ QTRS
  ↳ DependencyPairsProof
  ↳ QTRS Reverse
  ↳ QTRS Reverse
    ↳ QTRS

Q restricted rewrite system:
The TRS R consists of the following rules:

b(a(x)) → x
c(a(x)) → a(c(b(a(c(b(x))))))
c(b(x)) → x

Q is empty.